Extending XQuery with a Pattern Matching Facility
نویسندگان
چکیده
Considering the growing usage of XML for communication and data representation, the need for more advanced analytical capabilities on top of XQuery is emerging. In this regard, a pattern matching facility can be considered as a natural extension to empower XQuery. In this paper we first provide some use cases for XML pattern matching. After showing that current XQuery falls short in meeting basic requirements, we propose an extension to XQuery which imposes no changes into current model, while covering a wide range of important use cases. We also implemented our proposal into the MXQuery prototype and show through experiments that, compared to the existing pattern matching means, our extension is not only more expressive, but also more efficient.
منابع مشابه
A Core Calculus for XQuery 3.0 - Combining Navigational and Pattern Matching Approaches
XML processing languages can be classified according to whether they extract XML data by paths or pattern matching. In the former category one finds XQuery, in the latter XDuce and CDuce. The strengths of one category correspond to the weaknesses of the other. In this work, we propose to bridge the gap between two of these languages: XQuery and CDuce. To this end, we extend CDuce so as it can b...
متن کاملA Core Calculus for XQuery 3.0
XML processing languages can be classified according to whether they extract XML data by paths or pattern matching. In the former category one finds XQuery, in the latter XDuce and CDuce. The strengths of one category correspond to the weaknesses of the other. In this work, we propose to bridge the gap between two of these languages: XQuery and CDuce. We do it by extendingCDuce so as it can be ...
متن کاملFrom Tree Patterns to Generalized Tree Patterns: On Efficient Evaluation of XQuery
XQuery is the de facto standard XML query language, and it is important to have efficient query evaluation techniques available for it. A core operation in the evaluation of XQuery is the finding of matches for specified tree patterns, and there has been much work towards algorithms for finding such matches efficiently. Multiple XPath expressions can be evaluated by computing one or more tree p...
متن کاملXML Goes Native: Run-Time Representations for Xtatic
Xtatic is an extension of C with native support for statically typed XML processing. It features XML trees as built-in values, “tree grep” pattern matching, and an XML-specific type system. An implementation ofXtatic must address a number of issues common to any language supporting a declarative style of XML processing (e.g., XQuery, XSLT, XDuce, CDuce, Xact, Xen, etc.). In particular, it must ...
متن کاملGXQuery: Extending XQuery for Querying Graph-structured XML Data
XML data can be naturally modeled as a graph. Existing query languages to XML can only express queries of matching XML document with a tree-structured schema with structural and value constraints without the consideration of graph features. The ability of such query languages cannot satisfy various requirements of querying graph-structured XML data. In this paper, GXQuery is presented as an ext...
متن کامل